Constrained Motion Planning in Discrete State Spaces
نویسندگان
چکیده
We propose a principled method to create a search space for constrained motion planning, which efficiently encodes only feasible motion plans. The space of possible paths is encoded implicitly in the connections between states, but only feasible and only local connections are allowed. Furthermore, we propose a systematic method to generate a near-minimal set of spatially distinct motion alternatives. This set of motion primitives preserves the connectivity of the representation while eliminating redundancy – leading to a very efficient structure for motion planning at the chosen resolution.
منابع مشابه
Hybrid systems: from verification to falsification by combining motion planning and discrete search
We propose HyDICE, Hybrid DIscrete Continuous Exploration, a multilayered approach for hybrid-system falsification that combines motion planning with discrete search and discovers safety violations by computing witness trajectories to unsafe states. The discrete search uses discrete transitions and a state-space decomposition to guide the motion planner during the search for witness trajectorie...
متن کاملContinuous Arvand: Motion Planning with Monte Carlo Random Walks
Sampling-based approaches such as Probabilistic Roadmaps and Rapidly-exploring Random Trees are very popular in motion planning. Monte Carlo Random Walks (MRW) are a quite different sampling method. They were implemented in the Arvand family of planners, which have been successful in classical planning with its discrete state spaces and actions. The work described here develops an MRW approach ...
متن کاملLearning to Plan for Constrained Manipulation from Demonstrations
Motion planning in high dimensional state spaces, such as for mobile manipulation, is a challenging problem. Constrained manipulation, e.g. opening articulated objects like doors or drawers, is also hard since sampling states on the constrained manifold is expensive. Further, planning for such tasks requires a combination of planning in free space for reaching a desired grasp or contact locatio...
متن کاملDifferentially constrained mobile robot motion planning in state lattices
We present an approach to the problem of differentially constrained mobile robot motion planning in arbitrary cost fields. The approach is based on deterministic search in a specially discretized state space. We compute a set of elementary motions that connects each discrete state value to a set of its reachable neighbors via feasible motions. Thus, this set of motions induces a connected searc...
متن کاملContinuous-Field Path Planning with Constrained Path-Dependent State Variables
Planning autonomous long range traverses for planetary exploration and similar robotic missions requires several important capabilities. These include the ability to generate smooth, optimal paths, the ability to reason about constrained path-dependent state variables such as energy, and the ability to replan rapidly in response to new information. Existing path planning approaches provide one ...
متن کامل